A Tribonacci-Like Sequence of Composite Numbers
نویسنده
چکیده
We find a new Tribonacci-like sequence of positive integers 〈x0, x1, x2, . . .〉 given by xn = xn−1 + xn−2 + xn−3 , n ≥ 3, and gcd(x0, x1, x2) = 1 that contains no prime numbers. We show that the sequence with initial values x0 = 151646890045, x1 = 836564809606, x2 = 942785024683 is the current record in terms of the number of digits.
منابع مشابه
More Identities On The Tribonacci Numbers
In this paper, we use a simple method to derive di¤erent recurrence relations on the Tribonacci numbers and their sums. By using the companion matrices and generating matrices, we get more identities on the Tribonacci numbers and their sums, which are more general than that given in literature [E. Kilic, Tribonacci Sequences with Certain Indices and Their Sum, Ars Combinatoria 86 (2008), 13-22....
متن کاملA Pascal-like Triangle Related to the Tribonacci Numbers
A tile composed of two pieces, which we refer to as a fence tile, is introduced to give the Tribonacci numbers a new combinatorial interpretation. The interpretation is used to construct a Pascal-like triangle and various identities concerning the triangle are proven. An intuitive proof of a general identity for the Tribonacci numbers in terms of sums of products of the binomial coefficients is...
متن کاملTribonacci Sequences With Certain Indices And Their Sums
In this paper, we derive new recurrence relations and generating matrices for the sums of usual Tribonacci numbers and 4n subscripted Tribonacci sequences, fT4ng ; and their sums. We obtain explicit formulas and combinatorial representations for the sums of terms of these sequences. Finally we represent relationships between these sequences and permanents of certain matrices. 1. Introduction Th...
متن کاملA Complete Categorization of When Generalized Tribonacci Sequences Can Be Avoided by Additive Partitions
A set or sequence U in the natural numbers is defined to be avoidable if N can be partitioned into two sets A and B such that no element of U is the sum of two distinct elements of A or of two distinct elements of B. In 1980, Hoggatt [5] studied the Tribonacci sequence T = {tn} where t1 = 1, t2 = 1, t3 = 2, and tn = tn−1 + tn−2 + tn−3 for n ≥ 4, and showed that it was avoidable. Dumitriu [3] co...
متن کاملDeterminantal Representations for Generalized Fibonacci and Tribonacci Numbers
the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Abstract Using certain Hessenberg matrices, we provide some determinantal representations of the general terms of second-and third-order linear recurrence sequences with arbitrary initial values. Moreover, we provide explicit formu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017